Random regular graphs of high degree
نویسندگان
چکیده
Random d-regular graphs have been well studied when d is fixed and the number of vertices goes to infinity. We obtain results on many of the properties of a random d-regular graph when d = d n grows more quickly than √n. These properties include connectivity, hamiltonicity, independent set size, chromatic number, choice number, and the size of the second eigenvalue, among others. © 2001 John Wiley & Sons, Inc. Random Struct. Alg., 18, 346–363, 2001
منابع مشابه
The Giant Component Threshold for Random Regular Graphs with Edge Faults
Let G be a given graph (modelling a communication network) which we assume suuers from static edge faults: That is we let each edge of G be present independently with probability p (or absent with fault probability f = 1 ? p). In particular we are interested in ro-bustness results for the case that the graph G itself is a random member of the class of all regular graphs with given degree. Our r...
متن کاملRobustness of Random Graphs Based on Natural Connectivity
Recently, it has been proposed that the natural connectivity can be used to efficiently characterise the robustness of complex networks. Natural connectivity quantifies the redundancy of alternative routes in a network by evaluating the weighted number of closed walks of all lengths and can be regarded as the average eigenvalue obtained from the graph spectrum. In this article, we explore the n...
متن کاملSparse Regular Random Graphs: Spectral Density and Eigenvectors
We examine the empirical distribution of the eigenvalues and the eigenvectors of adjacency matrices of sparse regular random graphs. We find that when the degree sequence of the graph slowly increases to infinity with the number of vertices, the empirical spectral distribution converges to the semicircle law. Moreover, we prove concentration estimates on the number of eigenvalues over progressi...
متن کاملRegular Graphs and Optimal Network Design
Design Regular graphs have elicited a lot of interest in both theory and applications. As we discussed in Section 2.1, all graphs pertinent to the degree-diameter problem are regular. Large random regular graphs have been observed to have several opti-152
متن کاملIsoperimetric Numbers of Regular Graphs of High Degree with Applications to Arithmetic Riemann Surfaces
We derive upper and lower bounds on the isoperimetric numbers and bisection widths of a large class of regular graphs of high degree. Our methods are combinatorial and do not require a knowledge of the eigenvalue spectrum. We apply these bounds to random regular graphs of high degree and the Platonic graphs over the rings Zn. In the latter case we show that these graphs are generally nonRamanuj...
متن کاملStat 316 Stochastic Processes on Graphs q-Colorings of Random Graphs
2. G is a random regular graph with degree (k + 1). Heuristic statistical mechanics studies suggest a rich phase transition structure for the measure μG( · ). For any q ≥ 4, different regimes are separated by three distinct critical values of the average degree: 0 < αd(q) < αc(q) < αs(q). Such regimes can be characterized as follows (all the statements below are understood to hold with high pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Random Struct. Algorithms
دوره 18 شماره
صفحات -
تاریخ انتشار 2001